Predefined‐time distributed event‐triggered algorithms for resource allocation

نویسندگان

چکیده

The resource allocation problem in a distributed multi-agent system is considered this study. First, the authors develop predefined-time algorithm and analyse its convergence analysis using Lyapunov stability theory, which local constraint ensured by differential projection operator. Thus, predefined time obtained time-varying time-based generator. Second, to reduce communication consumption between agents, static as well dynamic-based event-triggered control scheme, where information broadcast only occurs at some discrete instants. Moreover, three proposed algorithms converge precisely global optimal solution. Besides, Zeno behaviour excluded above dynamic mechanisms. Finally, test algorithms' efficiency based on provided numerical examples.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive Algorithms in Distributed Resource Allocation

The allocation of scarce, reusable resources over time to interconnected tasks in uncertain and dynamic environments in order to optimize a performance measure is a general problem which arises in many real-world domains. The paper overviews several recent distributed approaches to this problem and compares their properties, such as the guarantees of finding a (near-) optimal solution, their ro...

متن کامل

Distributed Newton-type Algorithms for Network Resource Allocation

Most of today's communication networks are large-scale and comprise of agents with local information and heterogeneous preferences, making centralized control and coordination impractical. This motivated much interest in developing and studying distributed algorithms for network resource allocation problems, such as Internet routing, data collection and processing in sensor networks, and cross-...

متن کامل

Distributed resource allocation algorithms for peer-to-peer networks

In peer-to-peer networks, each peer plays the role of client and server. As server, it receives content requests made by other peers and needs to decide on what basis and to what extent it will satisfy these requests by uploading content to others. As client, it addresses its own requests to appropriate peers to download desired content after resources are granted. We consider a network of peer...

متن کامل

Computational Resource Exchanges for Distributed Resource Allocation

Appropriate abstractions, mechanisms, and policies for resource allocation is quickly emerging as the fundamental problem facing emerging computation and communication environments such as PlanetLab and the Grid. This paper explores the utility of one simple abstraction for global resource allocation with a number of appealing properties: a centralized auction that collects user descriptions of...

متن کامل

Resource Co-allocation Algorithms in Distributed Job Batch Scheduling

In this work, we present slot selection algorithms for job batch scheduling in distributed computing with non-dedicated resources. Jobs are parallel applications and these applications are independent. Existing approaches towards resource co-allocation and parallel job scheduling in economic models of distributed computing are based on search of time-slots in resource occupancy schedules. The s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IET cyber-physical systems

سال: 2022

ISSN: ['2398-3396']

DOI: https://doi.org/10.1049/cps2.12036